Synchronizing Chaos with Imperfections
نویسندگان
چکیده
Previous research on nonlinear oscillator networks has shown that chaos synchronization is attainable for identical oscillators but deteriorates in the presence of parameter mismatches. Here, we identify regimes which opposite occurs and show heterogeneity can synchronize conditions under cannot. This effect not limited to small mismatches observed random both homogeneous heterogeneous network structures. The results are demonstrated experimentally using Chua's further supported by numerical simulations theoretical analysis. In particular, propose a general mechanism based heterogeneity-induced mode mixing provides insights into phenomenon. Since individual differences ubiquitous often unavoidable real systems, it follows such imperfections be an unexpected source stability.
منابع مشابه
Quantum chaos and random matrix theory for fidelity decay in quantum computations with static imperfections
We determine the universal law for fidelity decay in quantum computations of complex dynamics in presence of internal static imperfections in a quantum computer. Our approach is based on random matrix theory applied to quantum computations in presence of imperfections. The theoretical predictions are tested and confirmed in extensive numerical simulations of a quantum algorithm for quantum chao...
متن کاملExperiments with Synchronizing Automata
We have improved an algorithm generating synchronizing automata with a large length of the shortest reset words. This has been done by refining some known results concerning bounds on the reset length. Our improvements make possible to consider a number of conjectures and open questions concerning synchronizing automata, checking them for automata with a small number of states and discussing th...
متن کاملSynchronizing Automata with Extremal Properties
We present a few classes of synchronizing automata exhibiting certain extremal properties with regard to synchronization. The first is a series of automata with subsets whose shortest extending words are of length Θ(n 2), where n is the number of states of the automaton. This disproves a conjecture that every subset in a strongly connected synchronizing automaton is cn-extendable, for some cons...
متن کاملSegmentation with Synchronizing Neural Oscillators
Zusammenfassung A neural network for the segmentation of sensory data is proposed. It is based on scale-space concepts and synchronizing behaviour of neural oscillators. Multiple objects of varying contrast are found in the sensory data and marked with a distinct timecode. The network operation is totally data-driven, with xed synaptic links between the elementary processing units.
متن کاملSynchronizing automata with random inputs
We study the problem of synchronization of automata with random inputs. We present a series of automata such that the expected number of steps until synchronization is exponential in the number of states. At the same time, we show that the expected number of letters to synchronize any pair of the famous Černý automata is at most cubic in the number of states.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2021
ISSN: ['1079-7114', '0031-9007', '1092-0145']
DOI: https://doi.org/10.1103/physrevlett.126.164101